Clique Cover and Graph Separation
نویسندگان
چکیده
منابع مشابه
Clique Cover on Sparse Networks
We consider the problem of edge clique cover on sparse networks and study an application to the identification of overlapping protein complexes for a network of binary protein-protein interactions. We first give an algorithm whose running time is linear in the size of the graph, provided the treewidth is bounded. We then provide an algorithm for planar graphs with bounded branchwidth upon which...
متن کاملHereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide⋆
A graph is (H1,H2)-free for a pair of graphsH1, H2 if it contains no induced subgraph isomorphic toH1 orH2. In 2001, Král’, Kratochvíl, Tuza, and Woeginger initiated a study into the complexity of Colouring for (H1,H2)free graphs. Since then, others have tried to complete their study, but many cases remain open. We focus on those (H1,H2)-free graphs where H2 is H1, the complement of H1. As thes...
متن کاملCohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کاملParallelizing Clique and Quasi-Clique Detection over Graph Data
In a wide variety of emerging data-intensive applications, such as social network analysis, Web document clustering, entity resolution, and detection of consistently co-expressed genes in systems biology, the detection of dense subgraphs (cliques and approximate or quasi-cliques) is an essential component. Unfortunately, these problems are NP-Complete and thus computationally intensive at scale...
متن کاملBounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid
The clique cover width of G, denoted by ccw(G), is the minimum value of the bandwidth of all graphs that are obtained by contracting the cliques in a clique cover of G into a single vertex. For i = 1, 2, ..., d, let Gi be a graph with V (Gi) = V , and let G be a graph with V (G) = V and E(G) = ∩di=1(Gi), then we write G = ∩di=1Gi and call each Gi, i = 1, 2, ..., d a factor of G. The case where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2014
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2594439